Encoding Lexicalized Tree Adjoining Grammars with a Nonmonotonic Inheritance Hierarchy
نویسندگان
چکیده
This paper shows how DATR, a widely used formal language for lexical knowledge representation, can be used to define an LTAG lexicon as an inheritance hierarchy with internal lexical rules. A bottom-up featural encoding is used for LTAG trees and this allows lexical rules to be implemented as covariation constraints within feature structures. Such an approach eliminates the considerable redundancy otherwise associated with an LTAG lexicon.
منابع مشابه
Encoding Lexicalized Tree Adjoining Grammars with a Nonmonotonic Inheritance Hierachy
This paper shows how DATR, a widely used formal language for lexical knowledge representation , can be used to define an I_TAG lexicon as an inheritance hierarchy with internal lexical rules. A bottom-up featu-ral encoding is used for LTAG trees and this allows lexical rules to be implemented as covariation constraints within feature structures. Such an approach eliminates the considerable redu...
متن کاملResources for Lexicalized Tree Adjoining Grammars and XML Encoding: TagML
This work addresses both practical and theorical purposes for the encoding and the exploitation of linguistic resources for feature based Lexicalized Tree Adjoining grammars (LTAG). The main goals of these specifications are the following ones: 1. Define a recommendation by the way of an XML (Bray et al., 1998) DTD or schema (Fallside, 2000) for encoding LTAG resources in order to exchange gram...
متن کاملStructure Sharing in Lexicalized Tree-Adjoining Grammars
We present a scheme for efficiently representing a lexicaiized tree-adjoining grammar (LTAG). The propcoed representational scheme allows for structure-sharing between lexical entries and the trees associated with the lexical items. A compact organization is achieved by organizing the lexicon in a hierarchical fashion and using inheritance as well as by using lexical and syntactic rules. While ...
متن کاملIn Proceedings ACL - 95 1 Encoding Lexicalized Tree Adjoining
This paper shows how DATR, a widely used formal language for lexical knowledge representation , can be used to deene an LTAG lexicon as an inheritance hierarchy with internal lexical rules. A bottom-up featural encoding is used for LTAG trees and this allows lexical rules to be implemented as co-variation constraints within feature structures. Such an approach eliminates the considerable redund...
متن کاملA Lexicalized Tree Ad- Joining Grammar for English. a Lexicalized Tree Adjoining Grammar for English. Automatic Acquisition of Datr Theories from Observations. Theories Des Lexicons: 6 Comparison with Related Work 5 Applying Lexical Rules
This paper shows how DATR, a widely used formal language for lexical knowledge representation, can be used to de ne an LTAG lexicon as an inheritance hierarchy with internal lexical rules. A bottom-up featural encoding is used for LTAG trees and this allows lexical rules to be implemented as covariation constraints within feature structures. Such an approach eliminates the considerable redundan...
متن کامل